An Effective Distributed Search Technique for Unstructured Peer-to-Peer Networks
نویسندگان
چکیده
This paper presents an efficient distributed search technique for unstructured P2P networks. The scheme employs Q-learning, power peers, specialized peers, load balancing, and mobile agents. Walkers are selected from neighbors as well as power peers. Each search process updates Q-values of nodes in different Q-tables. The mobile agent based load balancing scheme assists to route the queries to least loaded power peers. The idea of TTL enhancement is followed for extending a search process. Simulation results show that the technique outperforms existing search schemes.
منابع مشابه
An efficient message passing technique using route path information in unstructured peer to peer network
Peer-to-Peer overlay systems offer a substrate for the construction of large scale and distributed applications. The Peer-to-Peer technique is differentiated in to two major forms, Structured P2P and Unstructured P2P. In structured peer-to-peer networks, connections in the overlay are fixed. They typically use distributed hash table-based (DHT) indexing, such as in the Chord system. Unstructure...
متن کاملAn Effective Search in Unstructured Peer-to-Peer Overlay Networks
A peerto-peer (P2P) network is a distributed system in which peers employ distributed resources to perform a critical function in a decentralized fashion. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. The resultant networks may not perform searches eff...
متن کاملHeterogeneous Search in Unstructured Peer-to-Peer Networks
Resource search or discovery is a fundamental issue in peer-to-peer (P2P) and grid studies.1 Search objects, or resources, can be cycles, storage spaces, files, services, addresses, and so on. In general, systems are employing three categories of P2P-network architectures to improve search performance: centralized (such as Napster, http://www.napster.com/), decentralized but structured (such as...
متن کاملDynamic Querying in Structured Peer-to-Peer Networks
Dynamic Querying (DQ) is a technique adopted in unstructured Peer-to-Peer (P2P) networks to minimize the number of peers that is necessary to visit to reach the desired number of results. In this paper we introduce the use of the DQ technique in structured P2P networks. In particular, we present a P2P search algorithm, named DQ-DHT (Dynamic Querying over a Distributed Hash Table), to perform DQ...
متن کاملIsrl: Intelligent Search by Reinforcement Learning in Unstructured Peer-to-peer Networks
International Journal of Parallel, Emergent and Distributed Systems Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713729127 ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks Xiuqi Li a; Jie Wu a; Shi Zhong b a Department of Computer Science and Engineering, Florida Atla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008